class Solution {
public:
    bool hasIncreasingSubarrays(vector<int>& nums, int k) {
        int n = nums.size();
        vector<int> table(n, 1);

        for (int i = 1; i < n; i++) {
            if (nums[i] > nums[i - 1]) table[i] += table[i - 1];
        }
        for (int i = k - 1; i + k < n; i++)
            if (table[i] >= k && table[i + k] >= k) return true;

        return false;
    }
};